Representing derivatives of Chebyshev polynomials by Chebyshev polynomials and related questions
نویسندگان
چکیده
منابع مشابه
Polynomials Related to Generalized Chebyshev Polynomials
We study several classes of polynomials, which are related to the Chebyshev, Morgan-Voyce, Horadam and Jacobsthal polynomials. Thus, we unify some of well-known results.
متن کاملCurves Defined by Chebyshev Polynomials
Working over a field k of characteristic zero, this paper studies line embeddings of the form φ = (Ti, Tj , Tk) : A → A, where Tn denotes the degree n Chebyshev polynomial of the first kind. In Section 4, it is shown that (1) φ is an embedding if and only if the pairwise greatest common divisor of i, j, k is 1, and (2) for a fixed pair i, j of relatively prime positive integers, the embeddings ...
متن کاملSymmetrized Chebyshev Polynomials
We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves alternate) result that their coefficients are non-negative. As a corollary we find that Tn(c cos θ) and Un(c cos θ) are positive definite functions. We further s...
متن کاملOn integer Chebyshev polynomials
We are concerned with the problem of minimizing the supremum norm on [0, 1] of a nonzero polynomial of degree at most n with integer coefficients. We use the structure of such polynomials to derive an efficient algorithm for computing them. We give a table of these polynomials for degree up to 75 and use a value from this table to answer an open problem due to P. Borwein and T. Erdélyi and impr...
متن کاملCryptography using Chebyshev polynomials
We consider replacing the monomial xn with the Chebyshev polynomial Tn(x) in the Diffie-Hellman and RSA cryptography algorithms. We show that we can generalize the binary powering algorithm to compute Chebyshev polynomials, and that the inverse problem of computing the degree n, the discrete log problem for Tn(x) mod p, is as difficult as that for xn mod p.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Mathematics
سال: 2017
ISSN: 2391-5455
DOI: 10.1515/math-2017-0096